Optimal stochastic switching of some queueing networks

Stochastic Stability of Queueing Networks*

This paper investigates geometric stability and L p-stability of discrete-time Markov chains associated with closed and open queueing networks with Markovian routing. By geometric stability (resp. L p-stability) we mean that the chain is re-generative in the Harris-recurrent sense and that the times between the successive regeneration points have a bounded moment generating function (resp. a bo...

Stochastic comparison of queueing networks

Optimal Stochastic Scheduling of Forest Networks with Switching Penalties 1

We present structural properties of optimal policies for the problem of scheduling a single server in a forest network of N queues (without arrivals) subject to switching penalties. In addition to linear holding costs, we impose either lump sum switching costs or batch setup delays which are incurred at each instant the server processes a job in a queue diierent than the previous one. We use re...

Queueing analysis of buffered switching networks

This paper provides a method for analyzing the queueing behavior of switching net works constructed from switches that employ shared bu ering or parallel bypass input bu er ing It extends the queueing models rst intro duced by Jenq and later generalized by Szyman ski and Shaikh to handle these classes of networks Our analysis explicitly models the state of an en tire switch and infers informati...

Optimal Queueing Policies for Fast Packet Switching of Mixed Traffic

The power of ATM (asynchronous transfer mode) is its ability to provide bandwidth on demand: different sources can have different bandwidth requirements. Sources also differ in performance requirements: some ask for minimal delay variations whereas others must have extremely low cell loss probabilities. This paper shows how these complementary performance requirements can be exploited with an L...